An integrated framework for the diagnosis and correction of rule-based programsALPUENTE, M; BALLIS, D; CORREA, F et al.Theoretical computer science. 2010, Vol 411, Num 47, pp 4055-4101, issn 0304-3975, 47 p.Article

A syntactic correspondence between context-sensitive calculi and abstract machinesBIEMACKA, Malgorzata; DANVY, Olivier.Theoretical computer science. 2007, Vol 375, Num 1-3, pp 76-108, issn 0304-3975, 33 p.Article

Formalising Java RMI with explicit code mobilityAHEM, Alexander; YOSHIDA, Nobuko.Theoretical computer science. 2007, Vol 389, Num 3, pp 341-410, issn 0304-3975, 70 p.Article

Programmed grammars and their relation to the LBA problemBORDIHN, Henning; HOLZER, Markus.Acta informatica. 2006, Vol 43, Num 4, pp 223-242, issn 0001-5903, 20 p.Article

Automata, languages and programming (Crete, 8-12 July 2001)Orejas, Fernando; Spirakis, Paul G; van Leeuwen, Jan et al.Lecture notes in computer science. 2001, issn 0302-9743, isbn 3-540-42287-0, XIV, 1083 p, isbn 3-540-42287-0Conference Proceedings

Pseudo-minimal transducerMAUREL, D.Theoretical computer science. 2000, Vol 231, Num 1, pp 129-139, issn 0304-3975Conference Paper

A shorter proof that palindromes are not a Church-Rosser language, with extensions to almost-confluent and preperfect Thue systemsDUNLAING, Colm O; SCHLUTER, Natalie.Theoretical computer science. 2010, Vol 411, Num 3, pp 677-690, issn 0304-3975, 14 p.Article

A pseudo-random network mobile automaton with linear growthBOLOGNESI, Tommaso.Information processing letters. 2009, Vol 109, Num 13, pp 668-674, issn 0020-0190, 7 p.Article

The optimal read-once branching program complexity for the direct storage access functionBOLLIG, Beate.Information processing letters. 2008, Vol 106, Num 4, pp 171-174, issn 0020-0190, 4 p.Article

Semantic essence of AsmLGUREVICH, Yuri; ROSSMAN, Benjamin; SCHULTE, Wolfram et al.Theoretical computer science. 2005, Vol 343, Num 3, pp 370-412, issn 0304-3975, 43 p.Conference Paper

INTEX : an FST toolboxSILBERZTEIN, M.Theoretical computer science. 2000, Vol 231, Num 1, pp 33-46, issn 0304-3975Conference Paper

ICALP'97DEGANO, Pierpaolo; GORRIERI, Roberto; MARCHETTI-SPACCAMELA, Alberto et al.Theoretical computer science. 1999, Vol 221, Num 1-2, issn 0304-3975, 499 p.Conference Proceedings

An effective axiomatization for real time ACPFOKKINK, W; KLUSENER, S.Information and computation (Print). 1995, Vol 122, Num 2, pp 286-299, issn 0890-5401Article

Adaptive star grammars and their languagesDREWES, Frank; HOFFMANN, Berthold; JANSSENS, Dirk et al.Theoretical computer science. 2010, Vol 411, Num 34-36, pp 3090-3109, issn 0304-3975, 20 p.Article

Interference automataPANDURANGA RAO, M. V.Theoretical computer science. 2008, Vol 403, Num 1, pp 89-103, issn 0304-3975, 15 p.Article

Setting port numbers for fast graph explorationILCINKAS, David.Theoretical computer science. 2008, Vol 401, Num 1-3, pp 236-242, issn 0304-3975, 7 p.Article

Unfolding semantics of graph transformationBALDAN, Paolo; CORRADINI, Andrea; MONTANARI, Ugo et al.Information and computation (Print). 2007, Vol 205, Num 5, pp 733-782, issn 0890-5401, 50 p.Article

Operational semantics for Petri net componentsGROOTE, Jan Friso; VOORHOEVE, Marc.Theoretical computer science. 2007, Vol 379, Num 1-2, pp 1-19, issn 0304-3975, 19 p.Article

Online multi-coloring on the path revisitedCHRIST, Marie G; FAVRHOLDT, Lene M; LARSEN, Kim S et al.Acta informatica. 2013, Vol 50, Num 5-6, pp 343-357, issn 0001-5903, 15 p.Article

Approximating edge dominating set in dense graphsSCHMIED, Richard; VIEHMANN, Claus.Theoretical computer science. 2012, Vol 414, Num 1, pp 92-99, issn 0304-3975, 8 p.Article

Havel-Hakimi residues of unigraphsBARRUS, Michael D.Information processing letters. 2012, Vol 112, Num 1-2, pp 44-48, issn 0020-0190, 5 p.Article

Max-optimal and sum-optimal labelings of graphsJAMISON, Robert E; NARAYAN, Darren A.Information processing letters. 2012, Vol 112, Num 1-2, pp 26-31, issn 0020-0190, 6 p.Article

A game-theoretic characterization of Boolean grammarsKOUNTOURIOTIS, Vassilis; NOMIKOS, Christos; RONDOGIANNIS, Panos et al.Theoretical computer science. 2011, Vol 412, Num 12-14, pp 1169-1183, issn 0304-3975, 15 p.Article

An undecidable property of context-free linear ordersESIK, Z.Information processing letters. 2011, Vol 111, Num 3, pp 107-109, issn 0020-0190, 3 p.Article

Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphsHEGGERNES, Pinar; MEISTER, Daniel; PROSKUROWSKI, Andrzej et al.Theoretical computer science. 2011, Vol 412, Num 12-14, pp 1275-1297, issn 0304-3975, 23 p.Article